- strong primes
- стойкие простые числа (два простых числа р и q называются стойкими, если их произведение n таково, что, если pug неизвестны, разложение n на множители является очень трудоемкой задачей)
English-Russian cryptological dictionary . 2014.
strong primes
Смотреть что такое "strong primes" в других словарях:
Strong prime — In mathematics, a strong prime is a prime number with certain special properties. The definitions of strong primes are different in cryptography and number theory. Definition in cryptography In cryptography, a prime number p is strong if the… … Wikipedia
Strong pseudoprime — In number theory, a strong pseudoprime is a composite number that passes a pseudoprimality test. All primes pass this test, but a small fraction of composites pass as well, making them false primes . Unlike the Fermat pseudoprimes, for which… … Wikipedia
Strong Law of Small Numbers — In his humorous 1988 paper The Strong Law of Small Numbers, the mathematician Richard K. Guy makes the statement that There aren t enough small numbers to meet the many demands made of them. In other words, any given small number appears in far… … Wikipedia
Safe prime — A safe prime is a prime number of the form 2 p + 1, where p is also a prime. (Conversely, the prime p is a Sophie Germain prime.) The first few safe primes are5, 7, 11, 23, 47, 59, 83, 107, 167, 179, 227, 263, 347, 359, 383, 467, 479, 503, 563,… … Wikipedia
Número primo fuerte — Este artículo o sección sobre matemáticas necesita ser wikificado con un formato acorde a las convenciones de estilo. Por favor, edítalo para que las cumpla. Mientras tanto, no elimines este aviso puesto el 10 de septiembre de 2009. También… … Wikipedia Español
Goldbach's conjecture — is one of the oldest unsolved problems in number theory and in all of mathematics. It states::Every even integer greater than 2 can be written as the sum of two primes.Expressing a given even number as a sum of two primes is called a Goldbach… … Wikipedia
The Temptations — For other uses, see Temptation (disambiguation). The Temptations The Classic 5 lineup of The Temptations: David Ruffin (bottom left), Melvin Franklin (top left), Paul Williams (top right), Otis Williams (bottom right), and … Wikipedia
Riemann hypothesis — The real part (red) and imaginary part (blue) of the Riemann zeta function along the critical line Re(s) = 1/2. The first non trivial zeros can be seen at Im(s) = ±14.135, ±21.022 and ±25.011 … Wikipedia
Fermat number — In mathematics, a Fermat number, named after Pierre de Fermat who first studied them, is a positive integer of the form:F {n} = 2^{2^{ overset{n} {} + 1where n is a nonnegative integer. The first nine Fermat numbers are OEIS|id=A000215:As of|2008 … Wikipedia
Probable prime — In number theory, a probable prime (PRP) is an integer that satisfies a specific condition also satisfied by all prime numbers. Different types of probable primes have different specific conditions. While there may be probable primes that are… … Wikipedia
Mathematics and Physical Sciences — ▪ 2003 Introduction Mathematics Mathematics in 2002 was marked by two discoveries in number theory. The first may have practical implications; the second satisfied a 150 year old curiosity. Computer scientist Manindra Agrawal of the… … Universalium
